Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
نویسندگان
چکیده
In this paper we present a deterministic algorithm to compute the number of F^-points of an elliptic curve that is defined over a finite field Fv and which is given by a Weierstrass equation. The algorithm takes 0(log9 q) elementary operations. As an application wc give an algorithm to compute square roots mod p. For fixed .ï e Z, it takes 0(log9p) elementary operations to compute fx mod p.
منابع مشابه
Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
We give a generalization to Abelian varieties over finite fields of the algorithm of Schoof for elliptic curves. Schoof showed that for an elliptic curve E over F , given by a Weierstrass equation, one can compute the number of Q F -rational points of E in time 0((log<?) ). Our result is the following. Let A be an Abelian variety over F . Then one can compute the characteristic polynomial of th...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملConstructing Elliptic Curves with Prescribed Torsion over Finite Fields
The modular curve X1(N) parametrizes elliptic curves with a point of order N . For N ≤ 50 we obtain plane models for X1(N) that have been optimized for fast computation, and provide explicit birational maps to transform a point on our model of X1(N) to an elliptic curve. Over a finite field Fq, these allow us to quickly construct elliptic curves containing a point of order N , and can accelerat...
متن کاملThe Number of Rational Points on Elliptic Curves y2 = x3 + a3 on Finite Fields
In this work, we consider the rational points on elliptic curves over finite fields Fp. We give results concerning the number of points Np,a on the elliptic curve y ≡ x + a(mod p) according to whether a and x are quadratic residues or non-residues. We use two lemmas to prove the main results first of which gives the list of primes for which -1 is a quadratic residue, and the second is a result ...
متن کاملA remark on the computation of cube roots in finite fields
We consider the computation of cube roots in finite fields. For the computation of square roots in finite fields, there are two typical methods; the Tonelli-Shanks method [9, 12] and the Cipolla-Lehmer method [4, 6]. The former can be extended easily to the case of r-th roots, which is called the Adleman-Manders-Miller method [1], but it seems to be difficult to extend the latter to more genera...
متن کامل